Frontier between decidability and undecidability: a survey

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Game Theoretic Decidability and Undecidability∗

We study the possibility of prediction/decision making in a finite 2—person game with pure strategies, following the Nash(-Johansen) noncooperative solution theory. We adopt the epistemic logic KD as the base logic to capture individual decision making from the viewpoint of logical inference. Since some infinite regresses naturally arise in this theory, we use a fixed-point extension EIR of KD ...

متن کامل

The Boundary Between Decidability and Undecidability for Transitive-Closure Logics

To reason effectively about programs it is important to have some version of a transitive closure operator so that we can describe such notions as the set of nodes reachable from a program’s variables. On the other hand, with a few notable exceptions, adding transitive closure to even very tame logics makes them undecidable. In this paper we explore the boundary between decidability and undecid...

متن کامل

Decidability and Undecidability Results for Propositional Schemata

We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over intervals parameterized by arithmetic variables (e.g., ∧n i=1 pi, where n is a parameter). The satisfiability problem is shown to be undecidable for this new logic, but we introduce a very general class of schemata, called b...

متن کامل

Decidability and Undecidability in Probability Logic

We study computational aspects of a probabilistic logic based on a well-known model of induction by Valiant. We prove that for this paraconsistent logic the set of valid formulas is undecidable.

متن کامل

Decidability and Undecidability in Dynamical Systems

A computing system can be modelized in various ways: one being in analogy with transfer functions, this is a function that associates to an input and optionally some internal states, an output ; another being focused on the behaviour of the system, that is describing the sequence of states the system will follow to get from this input to produce the output. This second kind of system can be def...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2000

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(99)00102-4